Synonymous theories and knowledge representations in answer set programming
نویسندگان
چکیده
Article history: Received 15 August 2009 Received in revised form 7 July 2010 Accepted 10 February 2011 Available online 15 March 2011
منابع مشابه
Synonymus Theories in Answer Set Programming and Equilibrium Logic
The study of strong equivalence between logic programs or nonmonotonic theories under answer set semantics, begun in [18], is extended to the case where the programs or theories concerned are formulated in different languages. We suggest that theories in different languages be considered equivalent in the strong sense or synonymous if and only if each is bijectively interpretable (hence transla...
متن کاملComplexity of Model Checking and Bounded Predicate Arities for Non-ground Answer Set Programming
Answer Set Programming has become a host for expressing knowledge representation problems, which reinforces the interest in efficient methods for computing answer sets of a logic program. While for propositional programs, the complexity of this task has been amply studied and is wellunderstood, less attention has been paid to the case of nonground programs, which is much more important from a K...
متن کاملAnswer Set Programming for Computational Psychological Models
Our work explores the use of Answer Set Programming (ASP) (Gelfond & Lifschitz, 1991; Marek & Truszczynski, 1999) to formalize and reason about psychological knowledge. Whereas some psychological models have a clear quantitative nature, which allows modeling e.g. with neural networks or Bayesian networks, other models have a more logical or qualitative nature and are not suitable for formalizat...
متن کاملDATALOG with Constraints - An Answer-Set Programming System
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional logic is, arguably, the simplest ASP system with an intuitive semantics supporting direct modeling of problem constraints. However, for some applications, especially those requiring that transitive closure be computed,...
متن کاملA Logic Program Characterization of Causal Theories
Nonmonotonic causal logic, invented by McCain and Turner, is a formalism well suited for representing knowledge about actions, and the definite fragment of that formalism has been implemented in the reasoning and planning system called CCalc. A 1997 theorem due to McCain shows how to translate definite causal theories into logic programming under the answer set semantics, and thus opens the pos...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 78 شماره
صفحات -
تاریخ انتشار 2012